Sparse Parabolic Radon Transform with Nonconvex Mixed Regularization for Multiple Attenuation

نویسندگان

چکیده

The existence of multiple reflections brings difficulty to seismic data processing and interpretation in reflection exploration. Parabolic Radon transform is widely used attenuation because it easily implemented, highly robust efficient. However, finite acquisition aperture causes energy diffusion the domain, which leads residuals. In this paper, we propose a sparse parabolic with nonconvex Lq1-Lq2(0<q1,q2<1) mixed regularization (SPRTLq1-Lq2) that constrains sparsity primary overcome improve effect attenuation, respectively. This problem solved approximately by alternating direction method multipliers (ADMM) algorithm, give convergence conditions ADMM algorithm. proposed compared least squares (LSPRT) based on L1 (SPRTL1) for synthetic field data. We demonstrate improves resolution domain data, better results are obtained.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

multiple suppression in cmp data using parabolic radon transform

reflection seismic data consist of primary reflections, coherent and incoherent noises. one of the objectives of seismic data processing is to enhance the quality of the real signals by attenuating different kinds of noises. multiples constitute one of the most troublesome forms of coherent noises in exploration seismology. multiple reflections often destructively interfere with the desired pri...

متن کامل

Sparse Reduced Rank Regression With Nonconvex Regularization

In this paper, the estimation problem for sparse reduced rank regression (SRRR) model is considered. The SRRR model is widely used for dimension reduction and variable selection with applications in signal processing, econometrics, etc. The problem is formulated to minimize the least squares loss with a sparsity-inducing penalty considering an orthogonality constraint. Convex sparsity-inducing ...

متن کامل

Nonconvex Sparse Logistic Regression with Weakly Convex Regularization

In this work we propose to fit a sparse logistic regression model by a weakly convex regularized nonconvex optimization problem. The idea is based on the finding that a weakly convex function as an approximation of the `0 pseudo norm is able to better induce sparsity than the commonly used `1 norm. For a class of weakly convex sparsity inducing functions, we prove the nonconvexity of the corres...

متن کامل

trace reconstruction by parabolic radon transform

due to some difficulties during seismic data acquisition, like natural obstacles (high voltage electricity cable, bad coupling of geophones with the ground) some of the traces cannot be recorded. since bad traces make the final stack unclear, usually bad traces go mute while processing. the final image of the earth’s crust is highly dependent of the quality and resolution of acquired data and m...

متن کامل

A Graduated Nonconvex Regularization for Sparse High Dimensional Model Estimation

Many high dimensional data mining problems can be formulated as minimizing an empirical loss function with a penalty proportional to the number of variables required to describe a model. We propose a graduated non-convexification method to facilitate tracking of a global minimizer of this problem. We prove that under some conditions the proposed regularization problem using the continuous piece...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13042550